Almost everywhere equivalence of logics in finite model theory

نویسندگان

  • Lauri Hella
  • Phokion G. Kolaitis
  • Kerkko Luosto
چکیده

We introduce a new framework for classifying logics on finite structures and studying their expressive power. This framework is based on the concept of almost everywhere equivalence of logics, that is to say, two logics having the same expressive power on a class of asymptotic measure 1. More precisely, if L, L0 are two logics and ì is an asymptotic measure on finite structures, then L a.e. L0 (ì) means that there is a class C of finite structures with ì(C ) = 1 and such that L and L0 define the same queries on C. We carry out a systematic investigation of a.e. with respect to the uniform measure and analyze the a.e.-equivalence classes of several logics that have been studied extensively in finite model theory. Moreover, we explore connections with descriptive complexity theory and examine the status of certain classical results of model theory in the context of this new framework. x

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EQ-logics with delta connective

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

متن کامل

Size-Change Termination and Satisfiability for Linear-Time Temporal Logics

In the automata-theoretic framework, finite-state automata are used as a machine model to capture the operational content of temporal logics. Decision problems like satisfiability, subsumption, equivalence, etc. then translate into questions on automata like emptiness, inclusion, language equivalence, etc. Linear-time temporal logics like LTL, PSL and the linear-time μ-calculus have relatively ...

متن کامل

The Freedoms of Guarded Bisimulation

Guarded logics have been shown to be amazingly versatile and tractable logics since their inception by Andréka, van Benthem, Németi in [1]. Features otherwise known from modal logics are lifted to the richer setting of general relational structures. The leading idea in this generalisation is the relativisation of quantifiers to tuples that are guarded by relational atoms. In a sense that can be...

متن کامل

THEORIES IN FINITE MODELTHEORYJohn

Finite model theory stands at the intersection of complexity theory and model theory. Most of the work thus far in nite model theory is analogous to work in 1950's style model theory of rst order logic. That is, the focus is on the study of properties of the logic: expressibility, preservation theorems, criteria for equivalence among models. Around 1960, with Vaught's paper 22], which is still ...

متن کامل

On the Semantics of Graded Modalities

We enrich propositional modal logic with operators ◇ (n ∈ N) which are interpreted on Kripke structures as “there are more than n accessible worlds for which ...”, thus obtaining a basic graded modal logic GrK. We show how some familiar concepts (such as subframes, p-morphisms, disjoint unions and filtrations) and techniques from modal model theory can be used to obtain results about expressive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Bulletin of Symbolic Logic

دوره 2  شماره 

صفحات  -

تاریخ انتشار 1996